Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis
نویسندگان
چکیده
منابع مشابه
Alignment-Free Phylogenetic Reconstruction: Sample Complexity via a Branching Process Analysis
We present an efficient phylogenetic reconstruction algorithm allowing insertions and deletions which provably achieves a sequencelength requirement (or sample complexity) growing polynomially in the number of taxa. Our algorithm is distance-based, that is, it relies on pairwise sequence comparisons. More importantly, our approach largely bypasses the difficult problem of multiple sequence alig...
متن کاملAlignment-Free Phylogenetic Reconstruction
We introduce the first polynomial-time phylogenetic reconstruction algorithm under a model of sequence evolution allowing insertions and deletions—or indels. Given appropriate assumptions, our algorithm requires sequence lengths growing polynomially in the number of leaf taxa. Our techniques are distance-based and largely bypass the problem of multiple alignment. ∗CSAIL, MIT. †Department of Mat...
متن کاملMultiple Sequence Alignment Errors and Phylogenetic Reconstruction
.........................................................................................................................1 Chapter 1: Introduction................................................................................................5 Sequence evolution...................................................................................................6 Alignment Reconstruction.............
متن کاملThe sample complexity of multi-reference alignment
. The growing role of data-driven approaches to scientific discovery has unveiled a large class of models that involve latent transformations with a rigid algebraic constraint. Among them, multi-reference alignment (MRA) is a simple model that captures fundamental aspects of the statistical and algorithmic challenges arising from this new paradigm. In this model, an unknown signal is subject to...
متن کاملThe genealogy of a sample from a binary branching process
At time 0, start a time-continuous binary branching process, where particles give birth to a single particle independently (at a possibly time-dependent rate) and die independently (at a possibly time-dependent and age-dependent rate). A particular case is the classical birth–death process. Stop this process at time T > 0. It is known that the tree spanned by the N tips alive at time T of the t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2013
ISSN: 1050-5164
DOI: 10.1214/12-aap852